Local clustering for hierarchical ad hoc networks

Hierarchical, cluster-based routing greatly reduces routing table sizes compared to host-based routing and the amount of routing related signalling traffic, while reducing path efficiency [8] and generating some management traffic [5], [10], [13]. Proposals for and analysis of cluster-based routing in dynamic networks include [9] and [13]. We present a local clustering method that requires no extra messages, since the required messages are simple enough to be piggybacked on link layer or routing messages. Based on our initial simulations, the method produces intuitively good clusters, thereby minimizing address changes and allowing us to optimize routing traffic.